CBLO: a clustering based linear ordering for netlist partitioning
نویسندگان
چکیده
In this paper, we propose a clustering based linear ordering algorithm which consists of global ordering and local ordering. In the global ordering, the algorithm forms clusters from n given vertices and orders the clusters. In tlhe local ordering, the elements in each cluster are linearly ordered. The linear order, thus produced, is used to obtain optimal k-way partitioning based on scaded cost objective function. Experiment with 11 benchmark circuits for k-way (2 5 k 5 10) partitioning shows that the proposed algorithm yields an average of 10.6% improvement over MELO for the A-way scalled cost partitioning.
منابع مشابه
A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mapped to n points in d-dimensional space, and then a linear ordering of these n modules is constructed to be used as a basis for partitioning. In this paper, we propose two clustering based linear ordering algorithms takin...
متن کاملRecent directions in netlist partitioning: a survey
This survey describes research directions in netlist partitioning during the past two decades in terms of both problem formulations and solution approaches. We discuss the traditional min-cut and ratio cut bipartitioning formulations along with multi-way extensions and newer problem formulations, e.g., constraint-driven partitioning (for FPGAs) and partitioning with module replication. Our disc...
متن کاملork for S s to Circuit CI
Vertex orderings have been successfully applied to problems in netlist clustering and for system partitioning and layout [2] , [20]. We present a vertex ordering construction that encompasses most reasonable graph traversals. Two parameters-an attraction function and a window-provide the means for achieving various graph traversals and addressing particular clustering requirements. We then use ...
متن کاملMultiway partitioning via geometric embeddings, orderings, and dynamic programming
AbstructThis paper presents effective algorithms for multiway partitioning. Confirming ideas originally due to Hall, we demonstrate that geometric embeddings of the circuit netlist can lead to high-quality k-way partitionings. The netlist embeddings are derived via the computation of d eigenvectors of the Laplacian for a graph representation of the netlist. As Hall did not specify how to partit...
متن کاملClustering Test Ordering Algorithm
Vertex orderings have been successfully applied to problems in netlist clustering, for system partitioning and layout [2] [20]. We present a vertex ordering construction that encompasses most reasonable graph traversals. Two parameters { an attraction function and a window { provide the means for achieving various graph traversals and addressing particular clustering requirements. We then use d...
متن کامل